Evaluating genetic algorithms through the approximability hierarchy
نویسندگان
چکیده
Optimization problems frequently appear in any scientific domain. Most of the times, corresponding decision problem turns out to be NP-hard, and these cases genetic algorithms are often used obtain approximated solutions. However, difficulty approximate different NP-hard can vary a lot. In this paper, we analyze usefulness using depending on approximation class belongs to. particular, use standard approximability hierarchy, showing that especially useful for most pessimistic classes hierarchy.
منابع مشابه
Proving Weak Approximability Without Algorithms
A predicate f : {−1, 1} 7→ {0, 1} with ρ(f) = Ex∈{−1,1}k [f(x)] is said to be strongly approximation resistant if, for every ε > 0, given a near-satisfiable instance of MAX k-CSP(f), it is hard to find an assignment such that the fraction of constraints satisfied is outside the range [ρ(f)−ε, ρ(f) +ε]. A predicate which is not strongly approximation resistant is known as weakly approximable. We...
متن کاملReal options approach to evaluating genetic algorithms
The real options technique has emerged as an evaluation tool for investment under uncertainty. It explicitly recognizes future decisions, and the exercise strategy is based on the optimal decisions in future periods. This paper employs the optimal stopping policy derived from real options approach to analyze and evaluate genetic algorithms, specifically for the new branches namely Estimation of...
متن کاملMatching Pursuit through Genetic Algorithms
Matching Pursuit is a greedy algorithm that decomposes any signal into a linear expansion of waveforms taken from a redundant dictionary. Computing the projection of the signal on every element of the basis has a high computational cost. To reduce this computational cost, optimized computational error minimization methods have to be found. Genetic Algorithms have shown to be a good tool to this...
متن کاملDefinition Characterisation through Genetic Algorithms
The identification of definitions from natural language texts is useful in learning environments, for glossary creation and question answering systems. It is a tedious task to extract such definitions manually, and several techniques have been proposed for automatic definition identification in these domains, including rule-based and statistical methods. These techniques usually rely on linguis...
متن کاملRolling Element Bearing Design through Genetic Algorithms
The design of rolling element bearings has been a challenging task in the field of Mechanical Engineering. Traditional approaches to the design optimization of such bearings have proved to be computationally time intensive and have yielded solutions that are yet to be theoretically proven optimal. While most of the real aspects of the design are never disclosed by bearing manufacturers, the com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Science
سال: 2021
ISSN: ['1877-7511', '1877-7503']
DOI: https://doi.org/10.1016/j.jocs.2021.101388